Time-interleaved simulcast for tune-in reduction

ABSTRACT

A system and method for providing faster tuning into a chosen program in a time-sliced multicast and/or broadcast transmission environment. Multimedia data of the same source material but of different transmission and presentation characteristics are coded and compressed. According to various embodiments, simulcast streams of a program are time-sliced, placed maximally apart from each other in terms of transmission time, and sent over the channel.

FIELD OF THE INVENTION

The present invention relates generally to the transmission of mediastreams over a Digital Video Broadcasting channel, whereby the mediadatagrams of an identical source but of different transmission andpresentation characteristics are simulcast.

BACKGROUND OF THE INVENTION

This section is intended to provide a background or context to theinvention that is recited in the claims. The description herein mayinclude concepts that could be pursued, but are not necessarily onesthat have been previously conceived or pursued. Therefore, unlessotherwise indicated herein, what is described in this section is notprior art to the description and claims in this application and is notadmitted to be prior art by inclusion in this section.

The Digital Video Broadcasting (DVB) Project is a European initiative toprovide a common specification for delivering high bandwidth digitalmultimedia contents to set-top boxes and television set in adirect-to-home setting. This initiative has been adopted my severalcountries worldwide. The basic core standards are classified based onthe physical transmission mechanisms they are specialized for. Thesestandards are the Digital Video Broadcasting-Satellite (DVB-S); DigitalVideo Broadcasting-Cable (DVB-C); and Digital VideoBroadcasting-Terrestrial (DVB-T).

DVB-T is also referred to as the “Common 2 k/8 k specification.” Themulti-carrier modulation system used by DVB-T provides additionalrobustness in the presence of noise. It also enables the possibility totransmit in a large single frequency network (SFN), reusing frequencieswithin the network. Orthogonal Frequency Division Multiplexing (OFDM) isused by DVB-T in two modes: the 2K mode, which uses 1705 carriers, andthe 8K mode, which uses 6817 carriers. The size of the SFN depends onthe modes used: the 2K mode having a smaller SFN with a singletransmitter than an 8K mode.

DVB-T mobile services have been launched in various locations. Usingdiversity antenna receivers, services which targeted fixed antennareception can now also be received on the move. However, even thoughDVB-T has passed most suitability requirements for mobile applications,some concerns regarding data delivery for small handheld,battery-operated devices remained. Handheld mobile terminals requirespecific features from the transmission system serving them. Thesefeatures include (1) extended receiver battery life; (2) improved radiofrequency (RF) performance for mobile single antenna reception; (3)countering high levels of noise in a hostile transmission environment;and (4) efficient handovers. The Digital Video Broadcasting Handheld(DVB-H) standard has been developed. DVB-H uses the same basic conceptsof DVB-T but adds additional features to improve mobility, powerconsumption and SFN usability.

DVB systems were originally designed to transmit digital multimediacontents to consumers directly to their homes. However, it was alsorecognized that the same transmission system is useful for broadcastingto consumers other types of data such as firmware updates for set-topboxes, games for set-top boxes, program guides, Internet services, andproprietary data such as stock market information. This broadcasting ofdata is referred to as datacasting. Depending on the different types ofapplications that can use datacasting and their requirements, sixdifferent profiles were defined. These profiles are: (1) data piping;(2) data streaming; (3) multi-protocol encapsulation (MPE); (4) datacarousels; (5) object carousels; and (6) other protocols. Foraddressable data, such as data using Internet Protocol (IP) fortransmission, the MPE profile is the most appropriate profile. DVB-H isdesigned to be IP-based, and it therefore uses MPE as the datacastingprofile.

MPE-Forward Error Correction (MPE-FEC) is an optional multiplexer-layerFEC code based on Reed-Solomon (RS) codes. MPE-FEC is included in theDVB-H specifications to counter high levels of transmission errors. InMPE-FEC, the RS parity data is packed into a special FEC sectionreferred to as MPE-FEC so that an MPE-FEC-ignorant receiver can simplyignore these sections. The computation of MPE-FEC is performed in thelink layer, over IP packets before encapsulation into MPE sections.

In the following, the values correspond to the current standard. AnMPE-FEC frame is arranged as a matrix with 255 columns and a flexiblenumber of rows. Currently, column heights of 256, 512, 768, 1024 bytesare supported. FIG. 1 shows the structure of an MPE-FEC frame. Eachposition in the matrix hosts an information byte. The first 191 columnsare dedicated to Open Systems Interconnection (OSI) layer 3 datagrams,such as IP packets, and possible padding. This portion of the MPE-FECframe is referred to as the application data table (ADT). The next 64columns of the MPE-FEC frame are reserved for the RS parity information.This portion is referred to as the RS data table (RSDT).

The ADT can be completely or partially filled with datagrams. Theremaining space, when the ADT is partially filled, is padded with zerobytes. Padding is also performed when there is no space left in theMPE-FEC frame to fill the next complete datagram. The RSDT is computedacross each row of the ADT using RS (255, 191). It is not necessary tocompute the entire 64 columns of parity bytes, and some of theright-most columns of the RS data table can be completely discarded.This procedure is referred to as puncturing. The padded and puncturedcolumns are not sent over the transmission channel.

The strict constraint on power consumption was a significant shortcomingof DVB-T and hence made it unsuitable for handheld mobile terminals.Handheld mobile devices have a limited source of power. The powerconsumed in receiving, decoding and demodulating a standardfull-bandwidth DVB-T signal would use up a substantial amount of batterylife in a short period of time. Time slicing of the MPE-FEC frames wasused to solve this problem. Time slicing is similar to time divisionmultiplexing (TDM). In TDM, multiple data streams are sent over the samechannel by assigning each data stream unique slots in time. An advantageof TDM is its flexibility by allowing dynamic variations in the numberof signals sent in the channel and the ability to constantly adjust timeintervals to make optimal usage of the channel bandwidth.

When time-slicing is used, the data of a time-sliced service is sentinto the channel as bursts so that the receiver, using the controlsignals, remains inactive when no bursts are to be received. Thisreduces the power consumption in the receiver terminal. The bursts aresent at a significantly higher bit rate, and the inter-time-sliceperiod, also referred to as the off-time, is usually proportional to theaverage bitrate of the service(s) conveyed in the bursts. FIG. 2( a)shows the time-slicing of bursts with the various parameters thatcharacterize it. Each burst typically consists of two parts, the ADT andRSDT. Consequently, the burst time consists of the burst time for ADTand the burst-time for RSDT. Analogously, after the transmission of theADT of a burst, no application data of a certain program is transmittedfor a time duration, referred to herein as the effective off-time.

A method referred to as the “delta-t method” is used to indicate thetime interval that a receiver can switch off before it can switch backon to receive the next time slice of the service. The delta-t method isused to signal the time from the start of the currently-received MPE (orMPE-FEC) section to the start of the next burst. Delta-t times areindicated in every MPE section header, as illustrated in FIG. 2( b), sothat the loss of an MPE section or multiple sections does not affect thecapability of the receiver to accurately switch on at the beginning ofthe next time sliced burst. When time-slicing is in use, the time-slicestart and stop times are computed using the delta-t and themaximum_burst_duration fields in the headers of the time-sliced MPEsections. A time-sliced burst cannot start before the delta-t time whichis signaled by the MPE section headers of the previous time-sliced burstand cannot end later than the time indicated bydelta-t+maximum_burst_duration. The maximum allowed jitter as specifiedfor example in the standard ETSI EN 301 192 V1.4.1 (2004-11) DigitalVideo Broadcasting (DVB); DVB specification for data broadcasting canalso be taken into account.

When a burst of data is received by a DVB-H capable receiver, the datais buffered to be processed and presented during the off period betweenbursts. The burst size S_(b), defined as the amount of network layerbits received in a burst-duration, has to be less than the bufferavailable at the receiver for the particular service. The maximum burstduration t_(b) is also signaled for every time-sliced elementary streamso that, under poor reception conditions, the receiver can infer whenthe burst has ended.

The layer 3 datagrams are always carried in MPE sections regardless ofwhether MPE-FEC is used, thus enabling it to be fully backwardcompatible to MPE-FEC ignorant receivers. The last section in an ADTtable contains a table_boundary flag that signals the end of layer 3datagrams within the ADT. In a time-sliced scenario, an MPE-FEC-awarereceiver, upon encountering a table_boundary_flag, checks if all ADTsections are received correctly, for example using a Cyclic RedundancyCheck (CRC), and discards all remaining sections in the burst if all ADTsections are received correctly. If some of the ADT sections containerrors, then the RSDT sections are received and are used to attempt tocorrect the errors. An MPE-FEC-ignorant receiver simply ignores theMPE-FEC (the RSDT part of an MPE-FEC matrix) and switches off thereceiver until the next burst.

Aural and visual information are important components of most multimediaservices and applications operating over transmission systems. In orderto transmit aural and visual information in the current generation ofpopular networks, compression arrangements have been standardized. Mostof these compression arrangements use known human perceptual qualitiesalong with efficient binary data coding schemes to reduce redundantinformation and compress the input information. Both audio and videocompression arrangements process continuous blocks of uncompressedsamples to use the psycho-acoustic and psycho-visual information forredundancy reduction.

In point-to-multipoint (PTM)-type communications, simulcasting is oftenused to deliver data to receivers with heterogeneous capability. In aPTM communication scenario when a sender is sending a single mediastream to multiple receivers with heterogeneous capability, a fairdistribution system should deliver the media to the receivercommensurate with the capabilities of the individual receivers. Inpractice, however, this is a difficult proposition to achieve. The“fairness” issue arises from the fact that PTM transmission involves atrade-off between bandwidth efficiency and granularity of control overthe quality of reception to an individual receiver. In a single-rate PTMtransmission, the media transmission rate is chosen to match the lowestreceiver capacity in a particular session. This solution is sub-optimalboth in terms of bandwidth usage and receiver heterogeneity. Thesimulcasting approach is used to address this issue of fairdistribution, using the transmission of several streams of identicalsource media at varying transmission and presentation characteristics.For example, two streams of different picture sizes can be transmitted.

The use of time-slicing in DVB-H indicates that data of a program issent to the receiver in high-bit-rate bursts at specific time intervals.When a receiver tunes into a program, it either tunes into the channelduring the time interval when the time-sliced program data is beingtransmitted or during the off-time.

Two different possibilities are possible when a receiver tunes in. Thefirst possibility is that the receiver tunes in during the ADTtransmission of the time-sliced burst of the required program. A specialcase of tuning in during a burst is that that receiver tunes in just atthe beginning of the time-sliced burst of the required program. Thesecond possibility is that the receiver tunes in between consecutivetime-sliced bursts of the required program. When the receiver tunes intoa channel in the beginning or middle of the ADT transmission of atime-sliced burst, it can start data reception without any delay.However, when the receiver tunes into the channel after the ADTtransmission of the time-sliced burst for the program has ended, it hasto wait for an additional period of time before the next time-slicedburst for the program is transmitted. This delay can be anything fromzero (exclusive) to the effective off-time period. FIGS. 3( a)-3(c) showthe three different scenarios that can occur when a receiver tunes intoa service transmitted in a time-sliced DVB-H channel. In FIG. 3( a) thetuning in occurs at the beginning of a burst n. In FIG. 3( b), thetuning in occurs in the middle of burst n. In FIG. 3( c), the tuning inoccurs in between bursts n and n+1.

To estimate the probability that a receiver tunes into a time-slicedburst of a service, it is helpful to assume that the service bit rate isb_(s) and the total DVB-H channel bandwidth for all services transmittedthrough it is b_(c). If event E_(b) is defined as the event when areceiver tunes into the time-slice burst during its transmission, thenP(E_(b)) is defined as the probability that this event occurs. Thisprobability is given byP(E _(b))=b _(s) /b _(c)  (1)

In equation (1), it is assumed that the service is using the fullcapacity of the channel. It is also possible that a service does not usethe full capacity of the channel. For example, a time-sliced set ofDVB-H services can be multiplexed with continuous DVB-T services into asingle MPEG-2 transport stream. In such a parallel service case, b_(c)is defined to be the total bandwidth available for the set of DVB-Hservices. The probability P(E_(i)) that the receiver tunes into anoff-time of the service time-sliced burst is then given byP(E _(i))=(b _(c) −b _(s))/b _(c)  (2)P(E _(i))=1−P(E _(b))  (3)

Equations (1), (2) and (3) reveal that when b_(s) is much smaller thanb_(c), there is a very high probability that the receiver tunes into theservice during the off-time of the service. This indicates that there isa high probability that the receiver has to wait for information when ittunes into a channel to receive a service.

Program P is a streamed audio-visual presentation. The audio and thevideo components are coded separately, multiplexed together, andtime-sliced for carriage over the DVB-H radio network. A burst of Pcontains audio-visual data in an interval [τ_(s), τ_(e)]. The timeperiod during which data of P is transmitted is referred to as theburst-time t_(b). The burst-time consists of two parts, burst-times forADT (t_(bADT)) and RSDT (t_(bRSDT)). After the time interval t_(b), nodata of program P is transmitted for a time duration of Δt, referred toas the off-time. Analogously, after the transmission of the ADT of aburst, no application data of program P is transmitted for time durationof Δt_(e), referred to as the effective off-time The cycle-time δ isdefined as δ=t_(b)+Δt=t_(bADT)+Δt_(e), i.e., the time difference betweenthe start time of consecutive time-sliced bursts. The tune-in initiationtime τ_(t) is defined as that instant on the transmission curvetime-line when the user decides to consume P and initiates action toreceive data from the channel. The tune-in delay Δ_((T-IN)) is definedas the amount of time elapsed after τ_(t) to the moment when therendering of P starts. This is also referred to as channel zappingdelay, channel-switch delay, and start-up delay. Δ_((T-IN)) can beconsidered as a cumulative sum of the following component delays:

A1. Time-slice synchronization delay Δ_((T-SYNC)).

A2. Delay to compensate potentially incomplete reception of the firsttime-sliced burst Δ_((COMP)).

B. Reception duration of the first time-sliced burst Δ_((RCPT)).

C. Delay to compensate the size variation of FEC Δ_((FEC)).

D. Delay to compensate for the synchronization time between associatedmedia streams (e.g. audio and video) Δ_((M-SYNC)).

E. Delay until media decoders are refreshed to produce correct outputsamples denoted by Δ_((REFRSH)).

F. Delay to compensate the varying bitrate of a media bitstream denotedby Δ_((VBR-COMP)).

G. Processing delays of the receiver and player implementations denotedby Δ_((PROC)).

Thus, Δ_((T-IN)) can be given asΔ_((T-IN))=Δ_((T-SYNC))+Δ_((COMP))+Δ_((RCPT))+Δ_((FEC))+Δ_((M-SYNC))+Δ_((REFRSH))+Δ_((VBR-COMP))+Δ_((PROC))

It should be noted that the above equation of Δ_((T-IN)) is asimplification, as the delay to acquire the required transport-levelsignaling, such as Program Specific Information/Service Information(PSI/SI) and Entitlement Control Messages (ECM) for conditional access(CA), are not considered. Furthermore, it is assumed that noapplication-layer content protection is used and hence related delays,e.g., for acquiring the content protection keys, are omitted from thediscussion. Finally, the delay jitter of burst intervals (Delta-tJitter) is not handled as well but is straightforward to use as a guardinterval in the activation of the radio reception.

The delay Δ_((REFRSH)) is usually applicable to video only, whereas inaudio, Δ_((REFRSH)) would typically be equal to zero. The values ofother delay components are often identical for both audio and video.Δ_((T-SYNC)), Δ_((COMP)), and Δ_((RCPT)) are discussed in more detailsbelow.

As discussed above, there are two possibilities for the moment that theuser initiated the switch of programs relative to the transmission of P.In the first possibility, tune-in occurs during a burst carrying P asillustrated in FIG. 3( b). In a special case, tune-in occurs exactly atthe beginning of a burst carrying P (FIG. 3( a)). In the secondpossibility, tune-in occurs in between two consecutive bursts of P asillustrated in FIG. 3( c).

Before analysis of these scenarios, two delays are defined. The first,referred to as the time-slice synchronization delay Δ_((T-SYNC)), isdefined as the time elapsed from the moment when the user initiates thedesire to consume P to the moment when the receiver obtains data of P.The second, referred to as the incomplete data compensation delayΔ_((COMP)), is the delay incurred to compensate for the playbackduration of data that was not received before tune-in initiation timeτ_(t) in the burst. This delay is applicable only when tune-in occurs inthe middle of the burst transmission.

When the receiver tunes in during the burst-time for ADT, the decodingand/or playback has to be delayed by an amount that is equivalent to theplayback duration of those coded data units that occurred in the burstprior to the tune-in initiation time in order to guarantee playbackwithout any pause. In the special case, when a receiver tunes into Pexactly at the beginning of a burst, all data for decoding the burstbecomes available and hence Δ_((COMP))=0. It is noted that it may not bepossible to apply FEC decoding for error correction of an incompletelyreceived time-sliced burst, as the amount of data columns that were notreceived may outnumber the correction capability of the FEC code. Tokeep the following delay analysis and equations simple, it is assumedthat data is transmitted in decoding order, audio and video frames areinterleaved in ascending order of decoding times, the decoding order isidentical to the output order and the sampling curve is linear. Giventhese assumptions, the delay to compensate the incomplete reception ofthe first time-sliced burst becomesΔ_((COMP))=δ−(τ_(e)−τ_(t)).

Assuming a uniform random distribution of tune-in times during the firstreceived burst, Δ_((COMP)) ranges from 0 to δ and the expectedΔ_((COMP)) becomesE[Δ _((COMP))]=δ/2

The probability of tuning during a burst of a desired program is givenbyP(E _(b))=t _(bADT)/δ

When the receiver tunes into the program during the effective off-timeperiod, it has to wait until the next time-sliced burst for the desiredprogram starts. This delay can be anything from zero to the off-timeperiod Δt. If the time instant when receivers tune into the channel isassumed to be uniformly distributed, then the probability P(E_(o)) thata receiver tunes into an off-time is given byP(E _(o))=t _(e)/δ

The expected Δ_((T-SYNC)) isE[Δ _((T-SYNC)) ]=Δt/2

The reception duration of the time-sliced burst depends on the size ofthe first MPE-FEC frame containing the desired program, as well as thetransmission bitrate for the MPE-FEC frame. DVB-H allows the serviceprovider to select the size of the MPE-FEC frame in terms of the rows ofthe frame (256, 512, 768, or 1024), the number of application datacolumns in the frame, and the number of Reed-Solomon FEC columns in theframe. The transmission bitrate for the MPE-FEC frame depends on thebitrate of the MPEG-2 transport stream multiplex carrying the programwhich, in turn, depends largely on the modulation system used in theradio transmission. Furthermore, potential non-time-sliced servicesreduce the transmission bitrate of the time-sliced bursts accordingly.

It should be noted that if receivers started media decoding immediatelywhen the first IP datagram of the program is received, i.e., during thereception of the MPE-FEC frame, a corrupted IP datagram might not becorrectable by FEC decoding before its rendering time. Hence, receiversshould buffer an entire MPE-FEC frame and apply FEC decoding, ifnecessary, before decoding of the media streams.

Advanced Video Coding (AVC), also know as H.264/AVC, is a video codingstandard developed by the Joint Video Team (JVT) of ITU-T Video CodingExpert Group (VCEG) and ISO/IEC Motion Picture Expert Group (MPEG). AVCincludes the concepts of a Video Coding Layer (VCL) and a NetworkAbstraction Layer (NAL). The VCL contains the signal processingfunctionality of the codec—mechanisms such as transform, quantization,motion-compensated prediction, and loop filters. A coded pictureconsists of one or more slices. The NAL encapsulates each slicegenerated by the VCL into one or more NAL units.

Scalable Video Coding (SVC) provides scalable video bitstreams. Ascalable video bitstream contains a non-scalable base layer and one ormore enhancement layers. An enhancement layer may enhance the temporalresolution (i.e. the frame rate), the spatial resolution, and/or thequality of the video content represented by the lower layer or partthereof. In the SVC extension of AVC, the VCL and NAL concepts wereinherited.

Multi-view Video Coding (MVC) is another extension of AVC. An MVCencoder takes input video sequences (called different views) of the samescene captured from multiple cameras and outputs a single bitstreamcontaining all the coded views. MVC also inherited the VCL and NALconcepts.

Many video coding schemes utilize inter prediction, which is alsoreferred to as temporal prediction and motion compensation. Interprediction removes redundancy between subsequent pictures. H.264/AVC, asother today's video compression standards, divides a picture to a meshof rectangles for each of which a similar block in one of the decodedreference pictures is indicated. The location of the prediction block iscoded as motion vector that indicates the position of the predictionblock compared to the block being coded.

Decoded pictures used for predicting subsequent coded pictures and forfuture output are buffered in the decoded picture buffer (DPB). The DPBmanagement processes, including the storage process of decoded picturesinto the DPB, the marking process of reference pictures, and the outputand removal processes of decoded pictures from the DPB, are specified toenable efficient utilization of the buffer memory.

The reference picture management process in H.264/AVC is summarized asfollows. The maximum number of reference pictures used for interprediction, referred to as M, is indicated in the active sequenceparameter set. When a reference picture is decoded, it is marked as“used for reference.” If the decoding of the reference picture causedmore than M pictures to be marked as “used for reference,” then at leastone picture must be marked as “unused for reference.” The DPB removalprocess then removes pictures marked as “unused for reference” from theDPB if they are not needed for output as well. Each short-term pictureis associated with a variable PicNum that is derived from the syntaxelement frame_num, and each long-term picture is associated with avariable LongTermPicNum that is derived form the long_term_frame_idxwhich is signaled by the memory management control operation (MMCO).

There are two types of operations for the reference picture marking:adaptive memory control and sliding window. The operation mode forreference picture marking is selected on picture basis. The adaptivememory control requires the presence of MMCO commands in the bitstream.The memory management control operations enable explicit signaling whichpictures are marked as “unused for reference,” assigning long-termindices to short-term reference pictures, storage of the current pictureas long-term picture, changing a short-term picture to the long-termpicture, and assigning the maximum allowed long-term index for long-termpictures. If the sliding window operation mode is in use and there are Mpictures marked as “used for reference,” the short-term referencepicture that was first decoded picture among those short-term referencepictures that are marked as “used for reference” is marked as “unusedfor reference.” In other words, the sliding window operation moderesults in first-in-first-out buffering operations among short-termreference pictures. When some highest temporal layers are discarded,gaps in frame_num are present in the bitstream. In this case, thedecoding process generates short-term “non-existing” pictures having themissing frame_num values. Such “non-existing” pictures are handled inthe same way as normal short-term reference pictures in the slidingwindow reference picture marking process.

The hypothetical reference decoder (HRD), specified in Annex C of theH.264/AVC standard, is used to check bitstream and decoder conformances.The HRD contains a coded picture buffer (CPB), an instantaneous decodingprocess, a decoded picture buffer (DPB), and an output picture croppingblock. The CPB and the instantaneous decoding process are specifiedsimilarly to any other video coding standard, and the output picturecropping block simply crops those samples from the decoded picture thatare outside the signaled output picture extents. The DPB was introducedin H.264/AVC in order to control the required memory resources fordecoding of conformant bitstreams. There are two reasons to bufferdecoded pictures—for references in inter prediction and for reorderingdecoded pictures into output order. The DPB includes a unified decodedpicture buffering process for reference pictures and output reordering.A decoded picture is removed from the DPB when it is no longer used asreference and needed for output. The maximum size of the DPB thatbitstreams are allowed to use is specified in the Level definitions(Annex A) of H.264/AVC.

There are two types of conformance for decoders—output timingconformance and output order conformance. For output timing conformance,a decoder must output pictures at identical times compared to the HRD.For output order conformance, only the correct order of the outputpicture is taken into account. The output order DPB is assumed tocontain a maximum allowed number of frame buffers. A frame is removedfrom the DPB when it is no longer used as a reference and needed foroutput. When the DPB becomes full, the earliest frame in output order isoutput until at least one frame buffer becomes unoccupied.

In the H.264/AVC standard, the required DPB size for decoding abitstream is specified by the syntax element max_dec_frame_buffering.The syntax element num_reorder_frames indicates the maximum number offrames that precede any frame in the coded video sequence in decodingorder and follow it in output order. According to this value, thedecoder can start to output pictures as early as possible thus to reducethe end-to-end delay without overflowing the DPB.

SUMMARY OF THE INVENTION

Various embodiments provide a system and method for providing fastertuning into the chosen program in a time-sliced multicast and/orbroadcast transmission environment. Multimedia data of the same sourcematerial but of different transmission (bit rate for example) andpresentation (display size and sampling rate for example)characteristics are coded and compressed. According to variousembodiments, simulcast programs of a simulcast session are time-sliced,placed maximally apart from each other in terms of transmission time,and sent over the DVB-H channel. As used herein, the term “simulcastsession” refers to representing the same piece of content, the term“simulcast program” refers to independent representation of the contentcontaining all media types, and the term “simulcast stream” refers to anindependent stream of one media type.

With various embodiments, the expected tune-in time, i.e. the time fromthe moment a user switches channels via the user interface to the momentfirst media is played out, can be approximately reduced from δ/2 toδ(2k), where δ is the cycle time (i.e., the interval between thetransmission start times of two bursts of the same simulcast program)and k is the number of the simulcast programs of the same simulcastsession. If two replicated programs are used for a simulcast session ofa service, the related tune-in delay components are reduced by abouthalf, if three replicated programs are used for the simulcast of aservice then the tune-in delay components are reduced by aboutone-third, etc. Various embodiments can be used to provide errorresiliency of the broadcast/multicast stream by using representations ofthe lost packets from other replicated streams of the simulcast in thesame session.

These and other advantages and features, together with the organizationand manner of operation thereof, will become apparent from the followingdetailed description when taken in conjunction with the accompanyingdrawings, wherein like elements have like numerals throughout theseveral drawings described below.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a representation of a structure of an MPE-FEC frame;

FIG. 2( a) is a representation showing time-slicing in a DVB-H channel,where two time-sliced bursts along with parameters that define thebursts, and FIG. 2( b) is a representation showing the signaling of thedelta-t in MPE section of a time-sliced burst;

FIG. 3( a) shows a scenario by which a receiver can tune into a service,where the tuning in occurs at the beginning of a burst n; FIG. 3( b)shows a scenario by which a receiver can tune into a service, where thetuning in occurs in the middle of burst n; and FIG. 3( c) shows ascenario by which a receiver can tune into a service, where the tuningin occurs in between bursts n and n+1;

FIG. 4 is a depiction of a simulcasting occurring over a time-slicedDVB-H channel where program start special handling is used;

FIG. 5 shows how a single rate service is transmitted over a time-slicedDVB-H channel;

FIG. 6 shows how two simulcasts of the same service can be sent over atime-sliced DVB-H channel according to various embodiments;

FIG. 7 is a depiction of a simulcasting occurring over a time-slicedDVB-H channel where no program start special handling is used;

FIG. 8( a) shows time-sliced bursts of a single-rate stream, withoutsimulcasting; FIG. 8( b) shows the tune-in and reception of a singlerate stream; FIG. 8( c) shows time-sliced bursts of an example tune-intime to simulcast streams; and FIG. 8( d) is an illustration of thereception start time and received bursts of simulcast streams;

FIG. 9( a) illustrates an arbitrarily selected tune-in point whensimulcasting is not utilized; FIG. 9( b) illustrates an arbitrarilyselected reception start point when simulcasting is not utilized; FIG.9( c) illustrates a time-line of time-sliced bursts of the streams fordifferent resolutions; and FIG. 9( d) illustrates a situation in whichthe receiver wishes to process the higher resolution stream, but inwhich the first time-sliced burst occurring after the tune-in point isof a lower resolution;

FIG. 10 is a representation of a generic multimedia communicationssystem for use with various embodiments of the present invention;

FIG. 11 is a perspective view of an electronic device that can be usedin conjunction with the implementation of various embodiments of thepresent invention; and

FIG. 12 is a schematic representation of the circuitry which may beincluded in the electronic device of FIG. 11.

DETAILED DESCRIPTION OF VARIOUS EMBODIMENTS

Various embodiments provide a system and method for providing fastertuning into a chosen program in a time-sliced multicast and/or broadcasttransmission environment, such as a DVB-H environment. Multimedia dataof the same source material but of different transmission (e.g., bitrate) and presentation (e.g., display size and sampling rate)characteristics are coded and compressed. It is helpful to define asimulcast session S of the same source signal or the same multimediasource material as S={P_(i): 1≦i≦k}, where S consists of k independentlycoded programs P_(i), targeted at k different classes of receivers. Theprograms P_(i) ∀ i, represent the same source, but coded at differentqualities. Each program typically comprises more than one stream, suchas an audio stream and a video stream. The programs of a simulcastsession are time-sliced, placed maximally apart from each other in termsof transmission time, and sent over the DVB-H channel. Through thevarious embodiments, the related tune-in delay components, i.e. the timefrom the moment a user switches channels (i.e., programs of differentorigin, i.e., programs of different simulcast sessions) via the userinterface to the moment first media is played out, are expected toreduce approximately from about δ/2 to δ(2k), where δ is the cycle-time(interval between the transmission start times of two bursts of the samesimulcast program) and k is the number of the simulcast streams of thesame program. For example, in the case of two simulcast programs for asimulcast session, the relevant tune-in delay components becomeapproximately δ/4. When compared to the expected tune-in time of asingle-stream broadcast, a 50% saving is expected to be obtained.

The operation of the service infrastructure according to the inventionis described herein in a simplified form as a simulcast session havingtwo simulcast programs, P₁ and P₂. It is noted, however, that variousembodiments can be generalized to any number of simulcast programs. Eachprogram typically comprises more than one stream, such as an audiostream and a video stream. IP packets of both P₁ and P₂ are time-slicedand sent into the channel such that no time-sliced burst containingpackets of P₁ can have packets of P₂. In one embodiment, the media datain all time-slices (except potentially those that start the program)across the simulcast streams of a program are of the same duration d.Due to temporary variations of media bitrate, the duration d of themedia data in time-slices may also be somewhat varying but should besubstantially constant on average. Consequently, the cycle-time is inone embodiment also equal to d. A time-sliced burst of P₂ is sent intothe channel such that it is placed maximally apart from any time-slicedburst of P₁ in time. When the duration d of media data in time-slices isequal in simulcast streams, the interval between (the start of)consecutive time-sliced bursts of the simulcast session is equal to ddivided by the number of simulcast programs in the simulcast session.FIGS. 5 and 6 show the relative transmission times without and with theuse of simulcasting, respectively. The height of the bars illustratesthe bitrate of the stream, and it is observable that the simulcastprograms in FIG. 6 are of different bitrates.

In the following discussion of various embodiments, it is assumed thatan analog media signal, such as audio and video, is digitized or sampledto obtain media samples. Examples of samples include an individualpicture (i.e., an array of pixels) of a video sequence or apulse-code-modulated (PCM) audio sample of a certain sampling frequency.Media playback time refers to the intended rendering (e.g., playout,playback, output) time of a media sample. The media playback positionrefers to the currently-played media sample on a timeline of all themedia samples of a presentation.

In one embodiment, the transmission start times of each time-slicedburst and the start time of media in the burst are approximatelysynchronized. In other words, if a time-sliced burst contains media datain the range of t₀ to t₁, its transmission start time is T₀, and atime-sliced burst of another simulcast program of the same simulcastsession contains media data in the range of t₀+d to t₁+d, in whichd=(t₁−t₀)/2, then the transmission start time of the second time-slicedburst should be T₀+d.

It is noted that the presented synchronization of media playback timesand transmission start times of bursts is feasible at the start of asimulcast session only if the start of the simulcast programs in termsof media playback position is made such that the set of burstscontaining one burst from each simulcast program of a simulcast sessionis transmitted back-to-back. For example and as illustrated in FIG. 4,the first burst of P₁ (denoted as S_(a) in the figure) contains codedmedia samples for the range of 0 to d in playback time. The transmissionof the first burst of S_(a) is started in wall-clock time of T₀. Thetransmission duration (i.e., the burst-time) of the first burst of S_(a)is equal to d_(x). The first burst of P₂ (denoted as S_(b) in thefigure) is transmitted right after the first burst of S_(a) and containscoded media samples for the range of d_(x) to d/2 in media playbacktime. The second burst of S_(a) contains coded media samples for therange of d to 2d in playback time. The transmission of the second burstof S_(a) is started in wall-clock time of T₀+d. The second burst ofS_(b) contains coded media samples for the range of d/2 to 2d−d/2 inplayback time. The transmission of the second burst of S_(b) is startedin wall-clock time of T₀+d/2. The order of the first bursts of simulcastprograms should be in ascending order of receiver capability. In otherwords, the simulcast program requiring the least capabilities fromreceivers should be sent first, followed by the simulcast programrequiring the second least of receiver capabilities, etc. This orderensures that all receivers can receive and play the program right fromits beginning.

Another method for arranging the media data of simulcast programs tobursts at the start of the simulcast session is as follows. The firstMPE-FEC matrices for every simulcast program are transmittedback-to-back as one burst. It is assumed that the cycle-time δ for eachsimulcast program is identical after the second time-sliced burst foreach stream. The first cycle-time for simulcast program i, δ_(i,1), iscounted as follows:δ_(i,1)=(k−i+1)×δ/k; 1≦i≦k

The first burst of each simulcast program contains media samplesapproximately of the range of 0 to δ_(i,1).

In one embodiment, the cycle-time of all simulcast programs of asimulcast session is arranged to be constant (after the first cycle). Asthe bitrate for the simulcast programs is likely to differsignificantly, achieving a constant cycle-time δ may require, e.g., theuse of “parallel elementary streams” and/or a small number of rows inMPE-FEC matrices when the bitrate of the simulcast program is relativelylow.

In one embodiment, the cycle-time of program P_(i) is arranged to be aninteger multiple of the cycle-time of program P_(j), assuming that i>jand programs are ordered in ascending order in terms of requiredreceiver capability. When placing the bursts of the simulcast programsmaximally apart, only (δ_(i/)δ_(j))-th bursts of program P_(j) can beconsidered. Consequently, some of the bursts of P_(i) and P_(j) may besent back-to-back. Other algorithms for placing bursts of simulcastprograms apart are also possible.

In another embodiment, the second time-sliced bursts of a simulcastsession are transmitted such that P_((k)) is sent first followed byP_((k−1)), etc. until P₍₁₎.

There are several options for arranging the packet order within a burst,including:

-   1. ascending order according to sampling instants (audio and video    packets interleaved);-   2. descending order according sampling instants (audio and video    packets interleaved);-   3. time-wise grouping of data units and transmission of groups in    reverse decoding order relative to each other;-   4. priority-wise grouping of data units and transmission of groups    in ascending priority order;-   5. priority-wise and time-wise grouping of data units (in that    order) and transmission of priority groups in ascending priority    order and time groups within priority groups in reverse decoding    order; and-   6. time-wise and priority-wise groups of data units (in that order)    and transmission of time groups in reverse decoding order and    priority groups within time groups in ascending priority order.

Each of these options is described below.

The ascending order of packets according to sampling instants (audio andvideo packets interleaved) is not particularly helpful for reducing thetune-in delay. Coded data units, such as Real-time Transport Protocol(RTP) packets, are ordered in ascending order of sampling instants,i.e., RTP timestamps in case of RTP packets. When tune-in occurs duringthe burst-time, the delay component to compensate potentially incompletereception of the first time-sliced burst Δ_((COMP)) is proportional tothe tune-in initiation time relative to first sampling instant of theburst.

The descending order of packets according sampling instants (audio andvideo packets interleaved) enables receivers to obtain the first mediapacket of the burst, in decoding order, but is likely to result into apause between the playback of the first and second received bursts.

For time-wise grouping of data units and transmission of groups inreverse decoding order relative to each other, it is helpful to considerconsecutive bursts D_(i) of service S of k simulcast programs such thati=1, 2, . . . , k, and D_(k) is the first one of the considered burstsin transmission order. Let the time intervals contained in bursts D_(i)be equal to [τ_(si), τ_(ei)]. In order to reduce the tune-in delay,coded data units of burst D_(i) for i>1 are split to two groupsaccording to their sampling instants, the first and second groupsconsisting of data within [τ_(s(i−1)), τ_(ei)] and [τ_(si), τ_(s(i−1))],respectively, and the packets of the first group are sent earlier thanthe packet of the second group. Similarly, coded data units of burst D₁are transmitted as two groups containing data within [τ_(sk), τ_(el)]and [τ_(sl), τ_(sk)], and packet of the first of these groups is sentprior to the packets of the second group.

A receiver that desires to consume program P_(m) receives the firsttime-sliced burst of any simulcast program in S that carries data eithercommensurate with or inferior to its capabilities. A receiver may alsotune in to D_(i), i>m, and decode the contents of D_(i) in those partsthat it is capable of, such as the audio track or intra pictures only.To simplify the analysis, it is assumed that any receiver is able totune in to any burst D_(i) with potentially reduced audio-videoreproduction quality compared to the best achievable quality decodablefrom D_(i). The expected probability to tune-in during any burst D_(i)becomesP(E _(b,simulcast))=k×t _(bADT)/δ

In order to analyze the reduction of tune-in delay when the receptionstarted during any burst D_(i), two cases are considered separately.First, when the reception started during the period of [τ_(s(i−1)),τ_(ei)], i>1, or [τ_(sk), τ_(el)], i=1, all data in the period of[τ_(si), τ_(s(i−1))], i>1, or [τ_(sl), τ_(sk)], i=1, respectively, willbe received, provided that no transmission errors occur. The nextreceived burst will contain the immediately subsequent period of data,hence enabling pauseless playback. This tune-in time range is referredto as the second playback portion of the burst and with subscript bs inthe delay components. Second, subscript bf is used to denote that thereception started during the first playback portion of the burst, i.e.,the period of [τ_(si), τ_(s(i−1))], i>1, or [τ_(sl), τ_(sk)], i=1.

Δ_((T-SYNC),bs)=0 and Δ_((FIRST),bs)=0. The expected reception durationof the first burst and the expected probability of tuning in during thesecond playback portion of the burst are inversely proportional to thenumber of simulcast programs k in the service as follows:E[Δ _((RCPT),bs) ]=t _(bADT) /k+(t _(bADT) −t _(bADT) /k)/2=t_(bADT)×(k+1)/2kP(E _(bs))=P(E _(b,simulcast))×(1−1/k)

When the tune-in occurred during the first playback portion of a burst,some data of the burst would be useful and hence Δ_((T-SYNC),bf)=0.However, as the tune-in point within the first playback portion isarbitrary, the expected delay to achieve pauseless playback is asfollows:E[Δ _((RCPT),bf) ]=δ/k/2

The expected reception duration of the first burst and the expectedprobability of tuning in during the first playback portion are asfollows:E[Δ _((RCPT),bf) ]=t _(bADT) /k/2P(E _(bs))=P(E _(b,simulcast))/k=t _(bADT)/δ

Priority-wise grouping of data units and transmission of groups inascending priority order was reported to reduce tune-in delay inMultimedia Broadcast/Multicast System (MBMS) of 3GPP in D. Tian, V. K.Malamal Vadakital, M. M. Hannuksela, S. Wenger, and M. Gabbouj,“Improved H.264/AVC video broadcast/multicast,” Proc. of VisualCommunications and Image Processing (VCIP), July 2005. MBMS essentiallyuses continuous transmission, as observed by the application layer,rather than time-sliced transmission. It is expected that the impact ofpriority-wise grouping on tune-in delay reduction in time-slicedtransmission is moderate. Priority-wise grouping of data units todifferent MPE-FEC matrixes to obtain unequal error protection as afunction of priority has been proposed in V. K. Malamal Vadakital, M. M.Hannuksela, M. Rezaei, and M. Gabbouj, “Method for unequal errorprotection in DVB-H for mobile television,” Proc. of IEEE InternationalSymposium on Personal, Indoor and Mobile Radio Communications (PIMRC),September 2006. In the method, the multiplexed media datagramscorresponding to certain duration are encapsulated into two or moreMPE-FEC matrices according to their priority label. These MPE-FECmatrices are referred to as peer MPE-FEC matrices. The number of peerMPE-FEC matrices in a time-sliced burst is equal to the number of uniquepriority labels assigned to the datagrams. The FEC code rates of thepeer MPE-FEC matrices of a burst is selected such that the mostimportant MPE-FEC matrix gets the strongest protection. The peer MPE-FECmatrices of a burst are transmitted in ascending order of priority,i.e., the most important MPE-FEC matrix as the last one, to reduce theexpected tune-in delay and increase the number of decodable audio andvideo frames from the first burst.

Priority-wise grouping of data units takes advantage of the fact thatdifferent portions of the coded bit stream have different levels ofimportance to the overall subjective quality of the presentation.Priority partitioning is performed across all media streams of the sameprogram. For example, the audio stream can be ranked as high priority.The priority partitioning methods for video can be roughly categorizedinto data partitioning, region-of-interest prioritization, spatial,quality and temporal layering.

Priority-wise and time-wise grouping of data units, as explained above,can be combined to achieve the benefits of both grouping methods—unequalerror protection provided by the priority-wise grouping and reducedtune-in delay provided by the time-wise grouping. When time-wisegrouping is performed first as an outer grouping mechanism, the expectedtune-in delay is the same or slightly better compared to the use of thetime-wise grouping only. However, unequal error protection would requirethe use of double the amount of peer MPE-FEC matrices compared to theuse of priority-wise grouping only and the virtual interleaving depth ofthe peer MPE-FEC matrices is likely to be shallower, which may affectnegatively to the overall error robustness. When priority-wise groupingis performed as an outer grouping mechanism, unequal error protectionand error robustness is similar to what is achieved in V. K. MalamalVadakital, M. M. Hannuksela, M. Rezaei, and M. Gabbouj, “Method forunequal error protection in DVB-H for mobile television,” Proc. of IEEEInternational Symposium on Personal, Indoor and Mobile RadioCommunications (PIMRC), September 2006. However, expected tune-in delayis greater than when using time-wise grouping only.

When a user switches channels, the receiver receives the firsttime-slice of any simulcast program of the desired simulcast session,regardless of the capability of the receiver. If the first receivedtime-slice of the simulcast session is intended for receivers withcapabilities lower than the receiver could process, then the receivercontinues to decode and play the lower quality program until such pointwhen a time slice of a simulcast program commensurate with is capabilityarrives. If the first time-slice of the simulcast session is intendedfor receivers with higher capabilities than the receiver could process,then the receiver nevertheless starts reception. In such a scenario,however, the receiver is not able to decode all of the received data andmay have to perform post processing after decoding in order to properlypresent the media data based on the receiver's capabilities.

In one embodiment, multiple simulcast streams are only provided for asubset of the media components of a simulcast session, whereas only onestream is provided for the remaining media components. For example, twoindependent video streams originating from the same source video signalcan be provided as simulcast streams, whereas only one audio stream isprovided. The various embodiments are equally applicable to simulcaststreams of one media type rather than simulcast programs containing acomposition of media types. Media types having one stream in a simulcastsession can be multiplexed to the same bursts with any of the simulcaststream of another media type, or can be transmitted in separate bursts.

The following example further illustrates various embodiments describedherein. In this example, it is assumed that a video source is coded withtwo different compression parameters. These streams are referred to asS_(a) and S_(b). S_(a) is coded at picture size of Quarter VideoGraphics Array (QVGA) (320×240 pixels), and S_(b) is coded at picturesize of Video Graphics Array (VGA) (640×480 pixels). IP packets of bothS_(a) and S_(b) are time-sliced and sent into the channel such that notime-sliced burst containing packets of S_(a) can have packets of S_(b).Furthermore, it is assumed that a time-sliced burst of S_(a) containscompressed video data of 1 sec duration. In this case, it is desirablethat a time-sliced burst of S_(b) also have a compressed video data of 1second duration. A time-sliced burst of S_(b) is then sent into thechannel such that it is placed maximally apart from any time-slicedburst of S_(a) in time. It should be noted that the arrangement for thestart of the program is not considered in order to simplify the example.

FIGS. 8( a)-8(d) are representations depicting when a receiver tunes inand actual reception start times with and without simulcasting accordingto various embodiments. FIG. 8( a) shows time-sliced bursts of asingle-rate stream, without simulcasting. FIG. 8( b) shows the tune-inand reception of a single rate stream. FIG. 8( c) shows time-slicedbursts of an example tune-in time to simulcast streams. FIG. 8( d) is anillustration of the reception start time and received bursts ofsimulcast streams.

If two time-sliced bursts of S_(a) are sent at relative time instants 0sec and 1 sec, then the time-sliced bursts of S_(b) are sent at relativetime instants 0.5 sec (as depicted in FIG. 8( c)). Furthermore, thetime-sliced bursts of S_(a) correspond to the ranges from 0 to 1 secondand from 1 to 2 seconds, respectively, in a relative media playbacktimeline, and the time-sliced burst of S_(b) corresponds to the rangefrom 0.5 to 1.5 seconds in a relative media playback timeline. If areceiver capable of receiving S_(a), but not S_(b), tunes into thechannel at time instant 0.3, then the next time-sliced burst it canreceive is that of S_(b). Even though S_(b) is not commensurate with itscapabilities, it nevertheless receives at least the first half thetime-sliced burst of S_(b) as depicted in FIG. 8( d) (corresponding tothe range from 0.5 seconds to 1 second in the media playback timeline),decodes the subset of pictures of which it is capable within thecomputational constraints of the receiver (which typically is at leastthe present intra-coded pictures), post processes (which, in this case,may require sub-sampling of the resulting VGA pictures to QVGA display),and plays out the data before it receives the next time-sliced burstsuitable for its capabilities.

In an alternative time-slicing arrangement to the synchronizedtransmission start times and media playback start times in burstsdescribed above, all simulcast streams of a program can be time-slicedidentically in terms of media playback ranges per bursts. For example,in the example scenario described above, the time-sliced burst of S_(b)would correspond to the range from 0 to 1 second in the relative mediaplayback timeline. Bursts are still placed maximally apart as describedpreviously, but no special handling of the start of the program isneeded. This arrangement is illustrated in FIG. 7, with no specialhandling involved. In the case of two simulcast streams for a program,the expected tune-in time becomes approximately d/4 or 3d/8 when thestream of S_(a) or S_(b), respectively, provides the desired picturesize. These expected tune-in times are 50% or 25% smaller, respectively,compared to the expected tune-in time of a single-stream broadcast.

The following is a discussion demonstrating the improved toleranceagainst burst errors according to various embodiments. As notedpreviously, a receiver can receive a simulcast program of a simulcastsession. If there are transmission errors that are unrecoverable in atime-sliced burst (referred to herein as burst A), then the receivershould receive the next time-slice burst (referred to herein as burst B)of any simulcast program of the same session. If burst B is intended forreceivers with capabilities lower than the receiver could process, thenthe receiver can use all samples in burst B to conceal unrecoverablesamples in burst A. If burst B is intended for receivers withcapabilities higher than the receiver could process, then the receivermay only be able to use some of the samples in burst B given the limitedcomputational and memory resources. If there are more than two simulcastprograms for the same simulcast session, the receiver can use anysubsequent time-sliced burst of the session, provided that it would bebetter suited for the receiver for concealment of burst A. It should benoted that it may not be possible to conceal the first samples of burstA with samples of burst B, as the playback time of some burst A samplesmay have already passed at the time burst B is received. Furthermore, itis noted that the decoding of samples in burst B may require thepresence of a random access point, such as an Instantaneous DecodingRefresh (IDR) frame, in burst B. Alternatively, for some media formats,immediate decoding of samples regardless of the absence or presence ofearlier samples is possible. Still further, it can be signaled that themulticast streams cause the identical management of samples forprediction references, and consequently no random access point isnecessary. For example, identical management of samples is obtained whenthe same original pictures are encoded with two H.264/AVC encoders, thechoice of reference and non-reference pictures is identical, and slidingwindow and adaptive reference picture marking processes are appliedidentically. It should also be noted that an IDR picture may be presentin one stream, whereas another stream may contain a correspondingnon-IDR picture with a memory management control operation equal to 5(according to H.264/AVC), causing all the reference pictures to bemarked as “unused for reference” and the values of frame_num and pictureorder count to be considered as 0 after the decoding of the picture. Inother words, the impact of an IDR picture and a non-IDR picture with amemory management control operation equal to 5 is identical.

The following is a discussion of the implementation of variousembodiments discussed herein. Various embodiments are based on a systemin which datagrams are transmitted over DVB-H channel usingtime-slicing. The receivers can tune into a program carried by thechannel by joining a broadcast/multicast (PTM) session. A program can beadvertised using an electronic service guide (ESG). In the variousembodiments and as described previously, a user tunes into a particularprogram at an arbitrary moment relative to the time-sliced transmissionof the program. In a time-sliced DVB-H channel, tuning in can occureither during the transmission of a time-sliced burst of the program orin the off-time between the transmissions of two time-sliced bursts.According to one embodiment, a receiver (with the help of informationfrom the ESG) is aware that a program in the ESG is available as morethan one simulcast programs of a simulcast session and also has accessto any of those simulcast programs. However, for proper reception, thereceiver ideally must tune into the appropriate simulcast programcommensurate with its capabilities.

According to various embodiments, a simulcast session contains simulcastprograms, each having replicated media streams of different transmissionand presentation characteristics, but a representation of the same mediasource. A simulcast session S has n simulcast programs. The bandwidthallocated to a simulcast session referred to as session bandwidth andrestricts the total cumulative bit rate of the simulcast programs. Inthe simulcast session with all of its simulcast programs (S_(k)), thetotal number of programs n in the session S is greater than or equal to2. The index k runs from 1 to n, with both k and n being positiveintegers.

A receiver, with the help of ESG, chooses to tune in to simulcastsession S. The choice of the simulcast program within the session ismade by matching the receiver's capability to the simulcast programcharacteristics. The receiver chooses the simulcast program that is bestcommensurate with its terminal capability. The receiver then becomes apart of the multicast groups for the streams in the simulcast programwith m co-receivers tuned to the same simulcast program. The simulcastprogram with all its simulcast streams and the receivers can berepresented as S_(k) ^(r).

It is helpful to consider a stream of a simulcast program of a simulcastsession and refer to it and the streams of the same media type in theother simulcast programs of the same simulcast sessions as simulcaststreams. Every simulcast stream of a session is sent in a separatetime-sliced burst of a DVB-H channel. If α_(i) ^(s) denotes the i^(th)time-slice burst of the simulcast session S, then the time-sliced burstsα_(i) ^(s) must contain all media datagrams of one simulcast stream kper a particular media type, and the time sliced burst α_(i−1) ^(s) andα_(i+1) ^(s) contains datagrams of a simulcast stream other than k ofthe same media type. For example, if the simulcast session S has twosimulcast streams S₁ and S₂ of a particular media type, no time-slicedburst carrying the simulcast session S can have datagrams of stream S₁and S₂ in the same time-slice.

In one embodiment, the start time for a time sliced burst carryingdatagrams of simulcast stream k of simulcast session S is selected suchthat it is maximally apart from the start times of the time slicedbursts carrying datagrams of all other simulcast streams (of the samemedia type) other than k. For example, if a simulcast session S has twosimulcast streams S₁ and S₂ (of a particular media type) and the starttimes for two adjacent time-sliced bursts carrying datagrams of S₁ aret_(i) and t_(i+1), then the start time of the time sliced burst carryingthe datagrams of the simulcast stream S₂ is chosen such that it ismaximally apart from t_(i) and t_(i−1), i.e., (t_(i)+t_(i+1))/2.

A receiver tuning into a simulcast session receives the first timesliced burst of any simulcast program in the simulcast session Sirrespective of whether the simulcast stream was aimed for itscapabilities. If the receiver tunes into a simulcast program that issuperior to its capabilities, then it decodes a subset of received dataand may have to perform post-processing so that it can start consumptionof the media data. For example, if a receiver is capable of decoding andpresenting a video stream at Quarter Common Intermediate Format (QCIF)(176×144 pixels) resolution but has tuned into a simulcast streamcarrying datagrams with Common Intermediate Format (CIF) (352×288pixels) resolution, then it decodes a subset of the coded pictures anddown-samples the video frame resolution. If the receiver tunes into asimulcast program that is inferior to its capabilities, it continues toconsume this inferior media until such time when a time-slice burstcarrying the simulcast stream commensurate with its capability arrives.It can then switch to the simulcast program which carries datagramstuned to its capabilities. Switching can occur at the earliest randomaccess point, such as an IDR access unit of H.264/AVC video, in thesimulcast program commensurate with the receiver capabilities.

There are a number of ways to arrange the operation of the contentencoder and the content server. For example, the content encoder and theserver may reside in the same physical device, or they may be includedin separate devices. The content encoder and the server may operate withlive real-time content, in which case the coded media bitstream istypically not stored permanently, but rather buffered for small periodsof time in the content encoder and/or in the server to smooth outvariations in processing delay, transfer delay, and coded media bitrate.The content encoder may also operate for a considerable amount of timebefore the bitstream is transmitted from the server. In this case, thesystem may include a content database, which may reside in a separatedevice or in the same device as the content encoder or the server.

The traditional task of IP encapsulator is to compute MPE-FEC for acertain duration of media IP packets, encapsulate it into MPE-FECsections, and segment the MPE and MPE-FEC sections into smallertransport stream packets. In various embodiments discussed herein,however, the IP encapsulator has an additional task of ensuring that notime-sliced burst containing datagrams of a simulcast stream of asimulcast session contains data from another simulcast stream of thesame media type of the same simulcast session. Differentiation betweenthe simulcast streams of the same media type of a single simulcastsession may be performed based on the multicast address in the IPheader. Time-slice bursts for any simulcast program of the simulcastsession are, in one embodiment, all approximately of the same duration.This is done to facilitate constant time-slice intervals maximally apartfrom each other, which consequently minimizes the expected tune-indelay. Transmission times of the time-sliced burst between programs of asimulcast session are appropriately set so that any time-sliced burststart time of a program in a simulcast session is maximally apart fromother time-sliced burst start times of any other programs in the samesimulcast session.

FIGS. 9( a) and 9(b) illustrate an arbitrarily selected tune-in pointand a reception start point, respectively, when simulcasting is notutilized. The decoding of a lower or higher spatial resolution isdesired in FIGS. 9( a) and 9(b), respectively, and consequentlyreception can start from the subsequent time-sliced burst for thatresolution. FIG. 9( c) illustrates a time-line of time-sliced bursts ofthe streams for both resolutions. FIG. 9( d) illustrates the situationin which the receiver wishes to process the higher resolution stream,but in which the first time-sliced burst occurring after the tune-inpoint is of the lower resolution. In this scenario, the receiverreceives the time-sliced burst of the lower resolution, and additionallydecodes and renders data from the time-sliced burst of the lowerresolution until the first time-sliced burst of the higher resolution isreceived.

A server, according to one embodiment, comprises a normal IP Multicastserver using real-time media transport over Real-time Transport Protocol(RTP) as specified in Internet Engineering Task Force (IETF) Request forComments (RFC) 3550 and 3551. IETF RFC 3550 can be found atwww.ietf.org/rfc/rfc3550.txt, while IETF RFC can be found atwww.ietf.org/rfc/rfc3551.txt. The server encapsulates the coded mediabitstream into RTP packets according to an RTP payload format.Typically, each media type has a dedicated RTP payload format. It shouldbe noted that a system may contain more than one server. For simplicity,however, the following description considers only one server. The servertypically announces the availability media streams to the IPencapsulators using Session Description Protocol (SDP) over Real TimeStreaming Protocol (RTSP). In other words, RTSP as specified in RFC 2326(which can be found at www.ietf.org/rfc/rfc2326.txt) is used as thecontrol protocol, the characteristics of the RTP streams are announcedusing SDP as specified in RFC 2327, which can be found atwww.ietf.org/rfc/rfc2327.txt.

The server can use the SDP extension called the “grouping of medialines” discussed in RFC 3388 (which can be found atwww.ietf.org/rfc/rfc3388.txt) to associate two RTP streams together. Anew group attribute value, similar to lip synchronization (LS) and flowidentification (FID) described in section 4 of RFC 3388, is alsospecified. This new attribute is referred to as alternate streams (AS).The AS identification tag in the “a=group” line indicates the alternatestreams available in the simulcast. In order to encapsulate thealternate streams to different time-slices, the source IP address has todiffer (as the source IP address is used to differentiate an IP streamfrom another IP stream in Program Specific Information (PSI)/ServiceInformation (SI) of DVB-H). Therefore, the c attribute in SDP is used inthe media-level to specify the destination IP address. An example of anSDP description according to the invention is as follows:

-   -   v=0    -   o=Laura 289083124 289083124 IN IP4 one.example.com    -   t=0 0    -   a=group:AS 1 2    -   a=group:AS 3 4    -   m=video 30000 RTP/AVP 98    -   i=This media stream provides lossless quality    -   c=IN IP4 224.2.17.12/127    -   b=AS:384    -   a=rtpmap:98 H264/90000    -   a=fmtp:98 profile-level-id=42A00C; packetization-mode=0;    -   a=quality:10    -   a=mid:1    -   m=video 30000 RTP/AVP 99    -   i=This media stream provides default compressed quality    -   c=IN IP4 224.2.17.13/127    -   b=AS:128    -   a=rtpmap:99 H264/90000    -   a=fmtp:99 profile-level-id=42A00B; packetization-mode=0;    -   a=quality:5    -   a=mid:2    -   m=audio 30002 RTP/AVP 0    -   c=IN IP4 224.2.17.12/127    -   b=AS:64    -   a=mid:3    -   m=audio 30002 RTP/AVP 0    -   c=IN IP4 224.2.17.13/127    -   b=AS:32    -   a=mid:4

The 3GPP Packet-Switched Streaming Service (as described in PSS, 3GPPTechnical Specification 26.234) V6 defines a backwards-compatible methodfor signaling media alternatives in a single SDP file using the “alt”and “alt-default-id” attributes and the optional “alt-group” attribute.An old PSS client will simply ignore these attributes and will identifyonly one alternative per media. The “alt” and “alt-default-id”attributes may be used to signal the alternative simulcasts as discussedherein. The “alt” attribute is used to define the different fields andattributes for each of the existing simulcast streams. The“alt-default-id” is used to indicate the default media configuration.Any SDP media line except the “m=” line can be replaced for a givenalternative. This is why all simulcasts must share the same port numberand payload type. However, this is not seen as a restriction as long asthe different media lines are sent to different destination IPaddresses. Therefore, every new configuration should overwrite theconnection line “c=” at the media level.

The “alt-group” attribute may also be used to group media streams intoseveral alternatives based on grouping criteria such as bandwidth orlanguage. Grouping based on the bandwidth is especially suitable forsignaling the existence of the different simulcasts. This is the casebecause simulcasts of the same service typically are tailored fordifferent Integrated Receiver Decoder (IRD) classes according to theETSI Technical Specification 102 005 (“Digital Video Broadcasting (DVB);Specification for the use of Video and Audio Coding in DVB servicesdelivered directly over IP protocols,” v1.2.1 (2006-04) (a copy of whichcan be found atwebapp.etsi.org/exchangefolder/ts_(—)102005v010201p.pdf)) (e.g., oneclass for IRD-A, and one class for IRD-B terminals). Therefore, thedifferent alternatives have different bandwidth requirements.

The following SDP example shows how the “alt” and “alt-group” attributesmay be used in accordance with various embodiments:

-   -   v=0    -   o=Laura 289083124 289083124 IN IP4 one.example.com    -   t=0 0    -   a=alt-group:BW:AS:448=1,3; 192=2,4    -   m=video 30000 RTP/AVP 98    -   i=This media stream provides lossless quality    -   c=IN IP4 224.2.17.12/127    -   b=AS:384    -   a=rtpmap:98 H264/90000    -   a=fmtp:98 profile-level-id=42A00C; packetization-mode=0;    -   a=quality:10    -   a=alt-default-id:1        -   a=alt:2:b=AS:128        -   a=alt:2:i=This media stream provides default compressed            quality    -   a=alt:2:c=IN IP4 224.2.17.13/127    -   a=alt:2:a=fmtp:99 profile-level-id=42A00B; packetization-mode=0;    -   a=alt:2:a=quality:5    -   m=audio 30002 RTP/AVP 100    -   c=IN IP4 224.2.17.12/127    -   b=AS:64    -   a=rtpmap:100 AMR/12000    -   a=fmtp:100 octet-align=1    -   a=alt-default-id:3    -   a=alt:4:c=IN IP4 224.2.17.13/127    -   a=alt:4:b=AS:32    -   a=alt:4:a=rtpmap:100 AMR/8000

The existence of alternate simulcast programs and streams can also besignaled in the ESG in a backward compatible manner. The ESG providesthe service guide for all services available over a given DVB-H network.The ESG specification document [IP Datacast over DVB-H: ElectronicService Guide, ETSI TS 102 471; downloadable atwebapp.etsi.org/exchangefolder/ts_(—)102471v010201p.pdf] defines thedata model for providing the service guide. An ESG is defined also inthe Service Guide of Open Mobile Alliance Mobile Broadcast Services (OMABCAST Service Guide for Mobile Broadcast Services; Draft Version 1.0—4Jan. 2007). Based on the displayed ESG information, the user can selecta specific service. Furthermore, the ESG provides the necessaryinformation for the terminal to connect to the related IP streamscarrying the media streams of the selected service.

The data model is represented through an XML schema definition thatapplies to all ESG instances. An ESG instance comprises a set of ESGfragments and their relationships in conformance with the ESG datamodel. ESG defines several fragments such as the service fragment,schedule fragment, purchase fragment, and acquisition fragment. Theacquisition fragment provides the necessary information to locate andaccess the service. The acquisition fragment also provides a descriptionof the contents of the service in the component characteristic field.The complete syntax for this feature is specified in section 5.10.7.1 ofthe ESG specification document Sample syntax of the componentcharacteristic element is as follows:

<complexType name=“ComponentCharacteristicType” abstract=“true”>  <sequence>    <element name=“Bandwidth” type=“tva:BitRateType”minOccurs=“0”/>   </sequence>   <attribute name=“purpose” type=“string”use=“optional”/>  </complexType>  <complexTypename=“VideoComponentType”>   <complexContent>    <extensionbase=“esg:ComponentCharacteristicType”>     <sequence>      <elementname=“CodecCharacteristic” type=“esg:VideoCodecCharacteristicType”     minOccurs=“0”/>      <element name=“FrameRate”type=“tva:FrameRateType” minOccurs=“0”/>      <elementname=“OpenCaptionLanguage” type=“language” minOccurs=“0”/>      <elementname=“SignLanguage” type=“tva:SignLanguageType” minOccurs=“0”/>    </sequence>    </extension>   </complexContent>  </complexType> <complexType name=“VideoCodecCharacteristicType”>   <sequence>   <element name=“Codec” type=“tva:ControlledTermType” minOccurs=“0”/>   <element name=“ProfileLevelIndication” type=“tva:ControlledTermType”minOccurs=“0”/>   </sequence>  </complexType>  <complexTypename=“AudioComponentType”>   <complexContent>    <extensionbase=“esg:ComponentCharacteristicType”>     <sequence>      <elementname=“Codec” type=“tva:ControlledTermType” minOccurs=“0”/>      <elementname=“Mode” type=“tva:ControlledTermType” minOccurs=“0”/>      <elementname=“Language” type=“mpeg7:ExtendedLanguageType” minOccurs=“0”     maxOccurs=“unbounded”/>     </sequence>    </extension>  </complexContent>  </complexType>

In the ESG, there are two different ways to specify alternativesimulcasts of the same content: in the Service fragment or in theScheduleEvent fragment. In the Service fragment, several AcquisitionRefelements may be defined in order to refer to different alternatives foracquiring the same program. According to various embodiments, theexistence of several references to different acquisition fragmentsshould indicate alternative simulcasts of the same content and thedescription of each of the alternatives can be taken from theComponentDescription metadata. The terminal is then able to deploy theherein specified mechanism for fast access to any of the alternativestreams that come first in the DVB-H multiplex. Alternatively, theScheduleEvent Fragment may also be used to link a content instance withthe corresponding Service and several Acquisition fragments. Thisconfiguration is particularly beneficial when a content of limited(relatively short) duration is broadcast. The ScheduleEvent allows thedefinition of several AcquisitionRef elements for each content element.This should indicate alternative simulcasts of the same content. Theterminal therefore knows how the different simulcasts are accessed andcan then implement the various embodiments discussed herein. It shouldbe noted that these mechanisms are backwards-compatible to the currentESG specification. Alternatively, an extension of theAcquisitionFragment can be realized to indicate that the components ofthis service that are described through ComponentDescription elementsare alternatives. This can be achieved by adding an attribute that givesthe alternative group name to the ComponentDescription element asfollows:

<complexType name=″ComponentDescriptionType″> <sequence> <elementname=″ComponentCharacteristic″ type=″esg:ComponentCharacteristicType″minOccurs=″0″ maxOccurs=″unbounded″/> <element name=″SessionDescription″type=″esg:SessionDescriptionBaseType″/> </sequence> <attributename=”AlternativeGroup” type=”string” use=optional/>  </complexType>

The terminal is then able to identify alternative simulcasts based onthe AlternativeGroup name, where components that share the sameAlternativeGroup name are treated as alternatives.

For receivers that are unaware of the ESG signaling additions describedherein, no changes in the receiver operation compared to the establishedsystems are required.

FIG. 10 is a graphical representation of a generic multimediacommunication system within which various embodiments of the presentinvention may be implemented. As shown in FIG. 10, a data source 100provides a source signal in an analog, uncompressed digital, orcompressed digital format, or any combination of these formats. Anencoder 110 encodes the source signal into a coded media bitstream. Itshould be noted that a bitstream to be decoded can be received directlyor indirectly from a remote device located within virtually any type ofnetwork. Additionally, the bitstream can be received from local hardwareor software. The encoder 110 may be capable of encoding more than onemedia type, such as audio and video, or more than one encoder 110 may berequired to code different media types of the source signal. The encoder110 may also get synthetically produced input, such as graphics andtext, or it may be capable of producing coded bitstreams of syntheticmedia. In the following, only processing of one coded media bitstream ofone media type is considered to simplify the description. It should benoted, however, that typically real-time broadcast services compriseseveral streams (typically at least one audio, video and textsub-titling stream). It should also be noted that the system may includemany encoders, but in FIG. 10 only one encoder 110 is represented tosimplify the description without a lack of generality. It should befurther understood that, although text and examples contained herein mayspecifically describe an encoding process, one skilled in the art wouldunderstand that the same concepts and principles also apply to thecorresponding decoding process and vice versa.

The coded media bitstream is transferred to a storage 120. The storage120 may comprise any type of mass memory to store the coded mediabitstream. The format of the coded media bitstream in the storage 120may be an elementary self-contained bitstream format, or one or morecoded media bitstreams may be encapsulated into a container file. Somesystems operate “live”, i.e. omit storage and transfer coded mediabitstream from the encoder 110 directly to the sender 130. The codedmedia bitstream is then transferred to the sender 130, also referred toas the server, on a need basis. The format used in the transmission maybe an elementary self-contained bitstream format, a packet streamformat, or one or more coded media bitstreams may be encapsulated into acontainer file. The encoder 110, the storage 120, and the server 130 mayreside in the same physical device or they may be included in separatedevices. The encoder 110 and server 130 may operate with live real-timecontent, in which case the coded media bitstream is typically not storedpermanently, but rather buffered for small periods of time in thecontent encoder 110 and/or in the server 130 to smooth out variations inprocessing delay, transfer delay, and coded media bitrate.

The server 130 sends the coded media bitstream using a communicationprotocol stack. The stack may include but is not limited to Real-TimeTransport Protocol (RTP), User Datagram Protocol (UDP), and InternetProtocol (IP). When the communication protocol stack is packet-oriented,the server 130 encapsulates the coded media bitstream into packets. Forexample, when RTP is used, the server 130 encapsulates the coded mediabitstream into RTP packets according to an RTP payload format.Typically, each media type has a dedicated RTP payload format. It shouldbe again noted that a system may contain more than one server 130, butfor the sake of simplicity, the following description only considers oneserver 130.

The server 130 may or may not be connected to a gateway 140 through acommunication network. The gateway 140 may perform different types offunctions, such as translation of a packet stream according to onecommunication protocol stack to another communication protocol stack,merging and forking of data streams, and manipulation of data streamaccording to the downlink and/or receiver capabilities, such ascontrolling the bit rate of the forwarded stream according to prevailingdownlink network conditions. Examples of gateways 140 include multipointconference control units (MCUs), gateways between circuit-switched andpacket-switched video telephony, Push-to-talk over Cellular (PoC)servers, IP encapsulators in digital video broadcasting-handheld (DVB-H)systems, or set-top boxes that forward broadcast transmissions locallyto home wireless networks. When RTP is used, the gateway 140 is calledan RTP mixer or an RTP translator and typically acts as an endpoint ofan RTP connection.

The system includes one or more receivers 150, typically capable ofreceiving, de-modulating, and de-capsulating the transmitted signal intoa coded media bitstream. The coded media bitstream is transferred to arecording storage 155. The recording storage 155 may comprise any typeof mass memory to store the coded media bitstream. The recording storage155 may alternatively or additively comprise computation memory, such asrandom access memory. The format of the coded media bitstream in therecording storage 155 may be an elementary self-contained bitstreamformat, or one or more coded media bitstreams may be encapsulated into acontainer file. If there are many coded media bitstreams, such as anaudio stream and a video stream, associated with each other, a containerfile is typically used and the receiver 150 comprises or is attached toa container file generator producing a container file from inputstreams. Some systems operate “live,” i.e., omit the recording storage155 and transfer coded media bitstream from the receiver 150 directly tothe decoder 160. In some systems, only the most recent part of therecorded stream, e.g., the most recent 10-minute excerption of therecorded stream, is maintained in the recording storage 155, while anyearlier recorded data is discarded from the recording storage 155.

The coded media bitstream is transferred from the recording storage 155to the decoder 160. If there are many coded media bitstreams, such as anaudio stream and a video stream, associated with each other andencapsulated into a container file, a file parser (not shown in thefigure) is used to decapsulate each coded media bitstream from thecontainer file. The recording storage 155 or a decoder 160 may comprisethe file parser, or the file parser is attached to either recordingstorage 155 or the decoder 160.

The coded media bitstream is typically processed further by a decoder160, whose output is one or more uncompressed media streams. Finally, arenderer 170 may reproduce the uncompressed media streams with aloudspeaker or a display, for example. The receiver 150, recordingstorage 155, decoder 160, and renderer 170 may reside in the samephysical device or they may be included in separate devices.

FIGS. 11 and 12 show one representative electronic device 12 withinwhich various embodiments may be implemented. It should be understood,however, that the various embodiments are not intended to be limited toone particular type of device. The electronic device 12 of FIGS. 11 and12 includes a housing 30, a display 32 in the form of a liquid crystaldisplay, a keypad 34, a microphone 36, an ear-piece 38, a battery 40, aninfrared port 42, an antenna 44, a smart card 46 in the form of a UICCaccording to one embodiment, a card reader 48, radio interface circuitry52, codec circuitry 54, a controller 56 and a memory 58. Individualcircuits and elements are all of a type well known in the art, forexample in the Nokia range of mobile telephones.

The various embodiments described herein are described in the generalcontext of method steps or processes, which may be implemented in oneembodiment by a computer program product, embodied in acomputer-readable medium, including computer-executable instructions,such as program code, executed by computers in networked environments.Generally, program modules may include routines, programs, objects,components, data structures, etc. that perform particular tasks orimplement particular abstract data types. Computer-executableinstructions, associated data structures, and program modules representexamples of program code for executing steps of the methods disclosedherein. The particular sequence of such executable instructions orassociated data structures represents examples of corresponding acts forimplementing the functions described in such steps or processes.

Individual and specific structures described in the foregoing examplesshould be understood as constituting representative structure of meansfor performing specific functions described in the following claims,although limitations in the claims should not be interpreted asconstituting “means plus function” limitations in the event that theterm “means” is not used therein. Additionally, the use of the term“step” in the foregoing description should not be used to construe anyspecific limitation in the claims as constituting a “step plus function”limitation. To the extent that individual references, including issuedpatents, patent applications, and non-patent publications, are describedor otherwise mentioned herein, such references are not intended andshould not be interpreted as limiting the scope of the following claims.

Software and web implementations of various embodiments can beaccomplished with standard programming techniques with rule-based logicand other logic to accomplish various database searching steps orprocesses, correlation steps or processes, comparison steps or processesand decision steps or processes. It should be noted that the words“component” and “module,” as used herein and in the following claims, isintended to encompass implementations using one or more lines ofsoftware code, and/or hardware implementations, and/or equipment forreceiving manual inputs.

The foregoing description of embodiments have been presented forpurposes of illustration and description. The foregoing description isnot intended to be exhaustive or to limit embodiments to the preciseform disclosed, and modifications and variations are possible in lightof the above teachings or may be acquired from practice of variousembodiments. The embodiments discussed herein were chosen and describedin order to explain the principles and the nature of various embodimentsand its practical application to enable one skilled in the art toutilize the present invention in various embodiments and with variousmodifications as are suited to the particular use contemplated.

1. A method, comprising: generating a first coded data stream and asecond coded data stream both representing the same content, the firstcoded data stream and the second coded data stream being independentlydecodable from each other; transmitting portions of the first coded datastream in first and second time-sliced bursts; and transmitting aportion of the second coded data stream in a third time-sliced burst,wherein the transmission of the portions of the first and second codeddata streams do not overlap with each other, and occur subsequently toeach other in transmission order and substantially without delay betweentransmission of data.
 2. The method of claim 1, wherein a contentrendering duration of each of the first, second and third time-slicedbursts is substantially equal.
 3. The method of claim 2, wherein atransmission time of the third time-sliced burst is placed substantiallyin the middle of an interval between transmission times of the firsttime-sliced burst and the second time-sliced burst.
 4. The method ofclaim 3, wherein a content rendering range of the third time-slicedburst starts substantially from the middle of content rendering starttimes of the first and the second time-sliced bursts.
 5. The method ofclaim 3, wherein a content rendering range of the third time-slicedburst starts substantially from the same position as a content renderingstart time of the first time-sliced burst.
 6. The method of claim 1,further comprising generating and transmitting an indication of thesimilarity of a reference picture management of the first coded datastream and the second coded data stream.
 7. A computer program product,embodied in a non-transitory computer-readable medium, comprisingcomputer code configured to: generate a first coded data stream and asecond coded data stream both representing the same content, the firstcoded data stream and the second coded data stream being independentlydecodable from each other; transmit portions of the first coded datastream in first and second time-sliced bursts; and transmit a portion ofthe second coded data stream in a third time-sliced burst, wherein thetransmission of the portions of the first and second coded data streamsdo not overlap with each other, and occur subsequently to each other intransmission order and substantially without delay between transmissionof data.
 8. An apparatus, comprising: a processor; and a memory unitcommunicatively connected to the processor and including: computer codefor generating a first coded data stream and a second coded data streamboth representing the same content, the first coded data stream and thesecond coded data stream being independently decodable from each other;computer code for transmitting portions of the first coded data streamin first and second time-sliced bursts; and computer code fortransmitting a portion of the second coded data stream in a thirdtime-sliced burst, wherein the transmission of the portions of the firstand second coded data streams do not overlap with each other, and occursubsequently to each other in transmission order and substantiallywithout delay between transmission of data.
 9. The apparatus of claim 8,wherein a content rendering duration of each of the first, second andthird time-sliced bursts is substantially equal.
 10. The apparatus ofclaim 9, wherein a transmission time of the third time-sliced burst isplaced substantially in the middle of an interval between transmissiontimes of the first time-sliced burst and the second time-sliced burst.11. The apparatus of claim 10, wherein a content rendering range of thethird time-sliced burst starts substantially from the middle of contentrendering start times of the first and the second time-sliced bursts.12. The apparatus of claim 10, wherein a content rendering range of thethird time-sliced burst starts substantially from the same position as acontent rendering start time of the first time-sliced burst.
 13. A datatransmission system, comprising: means for generating a first coded datastream and a second coded data stream both representing the same, thefirst coded data stream and the second coded data stream beingindependently decodable from each other; means for transmitting portionsof the first coded data stream in first and second time-sliced bursts;and means for transmitting a portion of the second coded data stream ina third time-sliced burst, wherein the transmission of the portions ofthe first and second coded data streams do not overlap with each other,and occur subsequently to each other in transmission order andsubstantially without delay between transmission of data.
 14. The systemof claim 13, wherein a content rendering duration of each of the first,second and third time-sliced bursts is substantially equal.
 15. Thesystem of claim 14, wherein a transmission time of the third time-slicedburst is placed substantially in the middle of an interval betweentransmission times of the first time-sliced burst and the secondtime-sliced burst.
 16. A method, comprising: receiving a time-slicedburst of a first coded data stream and, subsequently, time-sliced burstsof a second coded data stream, both the first coded data stream and thesecond coded data stream representing the same content, the first codeddata stream and the second coded data stream being independentlydecodable from each other, the first coded data stream and the secondcoded data stream being conveyed in non-overlapping time-slices, andsubsequently to each other in transmission order and substantiallywithout delay between transmission of data; decoding a subset of thetime-sliced burst of the received first coded data stream; and decodinga subset of the time-sliced bursts of the received second coded datastream.
 17. The method of claim 16, wherein the decoding of the subsetof the time-sliced burst of the received first coded data stream and thedecoding of the subset of the time-sliced bursts of the received secondcoded data stream result in time-wise non-overlapping decoded samples ofthe content.
 18. The method of claim 17, wherein the time-wisenon-overlapping decoded samples of the content represent a continuoussignal.
 19. The method of claim 16, wherein the time-sliced burst of thefirst coded data stream is received before any of the time-sliced burstsof the second coded data stream.
 20. A computer program product,embodied in a non-transitory computer-readable medium, comprisingcomputer code configured to: receive a time-sliced burst of a firstcoded data stream and, subsequently, time-sliced bursts of a secondcoded data stream, both the first coded data stream and the second codeddata stream representing the same content, the first coded data streamand the second coded data stream being independently decodable from eachother, the first coded data stream and the second coded data streambeing conveyed in non-overlapping time-slices, and subsequently to eachother in transmission order and substantially without delay betweentransmission of data; decode a subset of the time-sliced burst of thereceived first coded data stream; and decode a subset of the time-slicedbursts of the received second coded data stream.
 21. An apparatus,comprising: a processor; and a memory unit communicatively connected tothe processor and including: computer code for processing a receivedtime-sliced burst of a first coded data stream and, subsequently,time-sliced bursts of a second coded data stream, both the first codeddata stream and the second coded data stream representing the samecontent, the first coded data stream and the second coded data streambeing independently decodable from each other, the first coded datastream and the second coded data stream being conveyed innon-overlapping time-slices, and subsequently to each other intransmission order and substantially without delay between transmissionof data; computer code for decoding a subset of the time-sliced burst ofthe received first coded data stream; and computer code for decoding asubset of the time-sliced bursts of the received second coded datastream.
 22. The apparatus of claim 21, wherein decoding the subset ofthe time-sliced burst of the received first coded data stream anddecoding the subset of the time-sliced bursts of the received secondcoded data stream results into time-wise non-overlapping decoded samplesof the content.
 23. The apparatus of claim 22, wherein the time-wisenon-overlapping decoded samples of the content represent a continuoussignal.
 24. The apparatus of claim 21, wherein the time-sliced burst ofthe first coded data stream is received before any of the time-slicedbursts of the second coded data stream.
 25. An apparatus, comprising:means for receiving a time-sliced burst of a first coded data streamand, subsequently, time-sliced bursts of a second coded data stream,both the first coded data stream and the second coded data streamrepresenting the same content, the first coded data stream and thesecond coded data stream being independently decodable from each other,the first coded data stream and the second coded data stream beingconveyed in non-overlapping time-slices, and subsequently to each otherin transmission order and substantially without delay betweentransmission of data; means for decoding a subset of the time-slicedburst of the received first coded data stream; and means for decoding asubset of the time-sliced bursts of the received second coded datastream.
 26. The apparatus of claim 25, wherein the decoding of thesubset of the time-sliced burst of the received first coded data streamand the decoding of the subset of the time-sliced bursts of the receivedsecond coded data stream result in time-wise non-overlapping decodedsamples of the content.
 27. The apparatus of claim 26, wherein thetime-wise non-overlapping decoded samples of the content represent acontinuous signal.
 28. The apparatus of claim 25, wherein thetime-sliced burst of the first coded data stream is received before anyof the time-sliced bursts of the second coded data stream.
 29. Theapparatus of claim 28, wherein the apparatus is configured to decode andrender the second coded stream.
 30. A method, comprising: receiving afirst time-sliced burst of a first coded data stream; identifying anunrecoverable error in the first time-sliced burst; receiving a secondtime-sliced burst of a second coded stream, wherein the secondtime-sliced bust is subsequent to the first time-sliced burst intransmission order; and in response to the identification of theunrecoverable error, decoding a subset of the content of the secondtime-sliced burst to conceal the unrecoverable error in the firsttime-sliced burst, wherein the first coded data stream and the secondcoded data stream are both representing the same content, the firstcoded data stream and the second coded data stream are independentlydecodable from each other, and wherein the first coded data stream andthe second coded data stream are conveyed in non-overlapping time-slicedbursts and substantially without delay between transmission of data. 31.The method of claim 30, wherein portions of the first coded stream areprovided in the first and second time-sliced bursts, a portion of thesecond coded data stream is provided in a third time-sliced burst, andwherein the portions of the first and second coded data streams do notoverlap with each other.
 32. A computer program product, embodied in anon-transitory computer-readable medium, comprising computer codeconfigured to perform: receive a first time-sliced burst of a firstcoded data stream; identify an unrecoverable error in the firsttime-sliced burst; receive a second time-sliced burst of a second codedstream, wherein the second time-sliced bust is subsequent to the firsttime-sliced burst in transmission order; and in response to theidentification of the unrecoverable error, decode a subset of thecontent of the second time-sliced burst to conceal the unrecoverableerror in the first time-sliced burst, wherein the first coded datastream and the second coded data stream are both representing the samecontent, the first coded data stream and the second coded data streamare independently decodable from each other, and wherein the first codeddata stream and the second coded data stream are conveyed innon-overlapping time-sliced bursts and substantially without delaybetween transmission of data.
 33. An apparatus, comprising: a processor;and a memory unit communicatively connected to the processor andincluding: computer code for processing a received first time-slicedburst of a first coded data stream; computer code for identifying anunrecoverable error in the first time-sliced burst; computer code forprocessing a received second time-sliced burst of a second coded stream,wherein the second time-sliced bust is subsequent to the firsttime-sliced burst in transmission order; and computer code for, inresponse to the identification of the unrecoverable error, decoding asubset of the content of the second time-sliced burst to conceal theunrecoverable error in the first time-sliced burst, wherein the firstcoded data stream and the second coded data stream are both representingthe same content, the first coded data stream and the second coded datastream are independently decodable from each other, and wherein thefirst coded data stream and the second coded data stream are conveyed innon-overlapping time-sliced bursts and substantially without delaybetween transmission of data.
 34. The apparatus of claim 33, whereinportions of the first coded stream are provided in the first and secondtime-sliced bursts, a portion of the second coded data stream isprovided in a third time-sliced burst, and wherein the portions of thefirst and second coded data streams do not overlap with each other. 35.An apparatus, comprising: means for receiving a first time-sliced burstof a first coded data stream; means for identifying an unrecoverableerror in the first time-sliced burst; means for receiving a secondtime-sliced burst of a second coded stream, wherein the secondtime-sliced bust is subsequent to the first time-sliced burst intransmission order; and means for, in response to the identification ofthe unrecoverable error, decoding a subset of the content of the secondtime-sliced burst to conceal the unrecoverable error in the firsttime-sliced burst, wherein the first coded data stream and the secondcoded data stream are both representing the same content, the firstcoded data stream and the second coded data stream are independentlydecodable from each other, and wherein the first coded data stream andthe second coded data stream are conveyed in non-overlapping time-slicedbursts and substantially without delay between transmission of data. 36.The apparatus of claim 35, wherein portions of the first coded streamare provided in the first and second time-sliced bursts, a portion ofthe second coded data stream is provided in a third time-sliced burst,and wherein the portions of the first and second coded data streams donot overlap with each other.
 37. The method of claim 30, furthercomprising: receiving an indication of the similarity of a referencepicture management of the first coded data stream and the second codeddata stream; and in response to an indication of identical referencepicture management, utilizing a reference picture resulting fromdecoding of the second coded data stream.
 38. The method of claim 30,wherein the decoding of the subset of the content of the secondtime-sliced burst is initiated from a random-access point.
 39. Themethod of claim 38, further comprising: receiving an indication of thesimilarity of a reference picture management of the first coded datastream and the second coded data stream; and in response to anindication of different reference picture management, initiating thedecoding of the subset of the content of the second time-sliced burstfrom the random-access point.